Object-to-group probabilistic distance measure for uncertain data classification
نویسندگان
چکیده
Uncertain objects, where each feature is represented by multiple observations or a given or fitted probability density function, arise in applications such as sensor networks, moving object databases and medical and biological databases. We propose a methodology to classify uncertain objects based on a new probabilistic distance measure between an uncertain object and a group of uncertain objects. This object-to-group probabilistic distance measure is unique in that it accounts separately for the correlations among the features within each class and within each object. We compare the proposed object-to-group classifier to two existing classifiers, namely, the K-Nearest Neighbor classifier on object means (certain-KNN) and the uncertain-naïve Bayes classifier. In addition, we compare the object-to-group classifier to an uncertain K-Nearest Neighbor classifier (uncertain-KNN), also proposed here, that uses existing probabilistic distance measures for object-toobject distances. We illustrate the advantages of the proposed classifiers with both simulated and real data.
منابع مشابه
A NEURO-FUZZY GRAPHIC OBJECT CLASSIFIER WITH MODIFIED DISTANCE MEASURE ESTIMATOR
The paper analyses issues leading to errors in graphic object classifiers. Thedistance measures suggested in literature and used as a basis in traditional, fuzzy, andNeuro-Fuzzy classifiers are found to be not suitable for classification of non-stylized orfuzzy objects in which the features of classes are much more difficult to recognize becauseof significant uncertainties in their location and...
متن کامل3D Scene and Object Classification Based on Information Complexity of Depth Data
In this paper the problem of 3D scene and object classification from depth data is addressed. In contrast to high-dimensional feature-based representation, the depth data is described in a low dimensional space. In order to remedy the curse of dimensionality problem, the depth data is described by a sparse model over a learned dictionary. Exploiting the algorithmic information theory, a new def...
متن کاملScalable Probabilistic Similarity Ranking in Uncertain Databases (Technical Report)
This paper introduces a scalable approach for probabilistic top-k similarity ranking on uncertain vector data. Each uncertain object is represented by a set of vector instances that are assumed to be mutually-exclusive. The objective is to rank the uncertain data according to their distance to a reference object. We propose a framework that incrementally computes for each object instance and ra...
متن کاملAccurate Fault Classification of Transmission Line Using Wavelet Transform and Probabilistic Neural Network
Fault classification in distance protection of transmission lines, with considering the wide variation in the fault operating conditions, has been very challenging task. This paper presents a probabilistic neural network (PNN) and new feature selection technique for fault classification in transmission lines. Initially, wavelet transform is used for feature extraction from half cycle of post-fa...
متن کاملProbabilistic Similarity Search for Uncertain Time Series
A probabilistic similarity query over uncertain data assigns to each uncertain database object o a probability indicating the likelihood that o meets the query predicate. In this paper, we formalize the notion of uncertain time series and introduce two novel and important types of probabilistic range queries over uncertain time series. Furthermore, we propose an original approximate representat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Neurocomputing
دوره 230 شماره
صفحات -
تاریخ انتشار 2017